A transference theorem for ergodic H1

A Marginal Ergodic Theorem

Michael Lavine Duke University, Durham, NC, USA. Summary. In recent years there have been several papers giving examples of Markov Chain Monte Carlo (MCMC) algorithms whose invariant measures are improper (have infinite mass) and which therefore are not positive recurrent, yet which have subchains from which valid inference can be derived. These are nonergodic (not having a limiting distributio...

A Mean Ergodic Theorem For Asymptotically Quasi-Nonexpansive Affine Mappings in Banach Spaces Satisfying Opial's Condition

Transference for the Erdős–ko–rado Theorem

For natural numbers n, r ∈ N with n ≥ r, the Kneser graph K(n, r) is the graph on the family of r-element subsets of {1, . . . , n} in which two sets are adjacent if and only if they are disjoint. Delete the edges of K(n, r) with some probability, independently of each other: is the independence number of this random graph equal to the independence number of the Kneser graph itself? We answer t...

A Quasi-ergodic Theorem for Evanescent Processes

We prove a conditioned version of the ergodic theorem for Markov processes, which we call a quasi-ergodic theorem. We also prove a convergence result for conditioned processes as the conditioning event becomes rarer.

Kingman's Subadditive Ergodic Theorem Kingman's Subadditive Ergodic Theorem

A simple proof of Kingman’s subadditive ergodic theorem is developed from a point of view which is conceptually algorithmic and which does not rely on either a maximal inequality or a combinatorial Riesz lemma.